About Fast and TReX Accelerations

نویسندگان

  • Christophe Darlot
  • Alain Finkel
  • Laurent Van Begin
چکیده

Fast and TReX tools are designed to analyse systems with infinite state spaces. They both implement algorithms computing the set of reachable states of such systems. Since the state space may be infinite, acceleration techniques are used . In this paper, we study the differences between Fast and TReX acceleration techniques and show that although Fast remains in Presburger logics while accelerating, TReX can produce 1 order arithmetical formulas even when accelerating functions from states belonging to a subset of Presburger.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Fast Generation of Bivariate Poisson Random Vectors

We present “Trivariate Reduction Extension” (TREx) — an exact algorithm for fast generation of bivariate Poisson random vectors. Like the NORTA procedure, TREx has two phases: a preprocessing phase when the required algorithm parameters are identified, and a generation phase when the parameters identified during the preprocessing phase are used to generate the desired Poisson vector. We prove t...

متن کامل

An Efficient Decision Procedure for Imperative Tree Data Structures

We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We ...

متن کامل

On an Efficient Decision Procedure for Imperative Tree Data Structures

We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We ...

متن کامل

The Nuclear Pore-Associated TREX-2 Complex Employs Mediator to Regulate Gene Expression

Nuclear pore complexes (NPCs) influence gene expression besides their established function in nuclear transport. The TREX-2 complex localizes to the NPC basket and affects gene-NPC interactions, transcription, and mRNA export. How TREX-2 regulates the gene expression machinery is unknown. Here, we show that TREX-2 interacts with the Mediator complex, an essential regulator of RNA Polymerase (Po...

متن کامل

Non-convex Global Minimization and False Discovery Rate Control for the TREX

The TREX is a recently introduced method for performing sparse high-dimensional regression. Despite its statistical promise as an alternative to the lasso, square-root lasso, and scaled lasso, the TREX is computationally challenging in that it requires solving a non-convex optimization problem. This paper shows a remarkable result: despite the non-convexity of the TREX problem, there exists a p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 128  شماره 

صفحات  -

تاریخ انتشار 2005